Operated semigroups, Motzkin paths and rooted trees

نویسنده

  • Li Guo
چکیده

Combinatorial objects such as rooted trees that carry a recursive structure have found important applications recently in both mathematics and physics. We put such structures in an algebraic framework of operated semigroups. This framework provides the concept of operated semigroups with intuitive and convenient combinatorial descriptions, and at the same time endows the familiar combinatorial objects with a precise algebraic interpretation. As an application, we obtain constructions of free Rota-Baxter algebras in terms of Motzkin paths and rooted trees.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

2-Binary trees: Bijections and related issues

A 2-binary tree is a binary rooted tree whose root is colored black and the other vertices are either black or white. We present several bijections concerning different types of 2-binary trees as well as other combinatorial structures such as ternary trees, non-crossing trees, Schröder paths, Motzkin paths and Dyck paths. We also obtain a number of enumeration results with respect to certain st...

متن کامل

Generalizations of Chung-feller Theorems

In this paper, we develop a method to find Chung-Feller extensions for three kinds of different rooted lattice paths and prove Chung-Feller theorems for such lattice paths. In particular, we compute a generating function S(z) of a sequence formed by rooted lattice paths. We give combinatorial interpretations to the function of Chung-Feller type S(z)−yS(yz) 1−y for the generating function S(z). ...

متن کامل

Constructing combinatorial operads from monoids

We introduce a functorial construction which, from a monoid, produces a set-operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operad obtained from the additive monoid. These involve various familiar combinatorial objects: parking functions, packed words, planar rooted trees, generalized Dyck paths, Schröder trees, Motzkin paths, integer compositions, directed an...

متن کامل

Secondary structures, plane trees and Motzkin numbers

A bijective correspondence is established between secondary structures of a given rank and size and plane trees satisfying certain additional conditions. The correspondence is then used to obtain new combinatorial interpretations of Motzkin numbers in terms of plane trees and Dyck paths.

متن کامل

Minimal and maximal plateau lengths in Motzkin paths

The minimal length of a plateau (a sequence of horizontal steps, preceded by an upand followed by a down-step) in a Motzkin path is known to be of interest in the study of secondary structures which in turn appear in mathematical biology. We will treat this and the related parameters maximal plateau length, minimal horizontal segment and maximal horizontal segment as well as some similar parame...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008